The ubiquitous Gaussian limit law in analytic combinatorics
نویسنده
چکیده
Data is everywhere, notably in this information explosion era. Beyond the first-order summary of a sample by its average value or its median, the bell-shaped Gaussian (or normal) curve has long been observed in the histograms of many data samples since the early history of probability, statistics and related fields. The Gaussian distribution, known commonly under the name of Law of Frequency of Errors, first appeared in 1733 in de Moivre’s works (see his Doctrine of Chance, second edition, first published in 1738, and [9]) as the limit of suitably normalized binomial distributions; see Figure 1. The following intuitive arguments of G. Galilei (see [9, Ch. 1]) may be regarded as the first-level description of the Law:
منابع مشابه
Analytic Combinatorics of Chord Diagrams Analytic Combinatorics of Chord Diagrams Combinatoire Analytique Des Diagrammes De Cordes Analytic Combinatorics of Chord Diagrams
In this paper we study the enumeration of diagrams of n chords joining 2n points on a circle in disjoint pairs. We establish limit laws for the following three parameters: number of components, size of the largest component, and number of crossings. We also nd exact formulas for the moments of the distribution of number of components and number of crossings. Key-words: Analytic combinatorics, c...
متن کاملThe Order Steps of an Analytic Combinatorics
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. This theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology and information theory. With a caref...
متن کاملDominant poles and tail asymptotics in the critical Gaussian many-sources regime
The dominant pole approximation (DPA) is a classical analytic method to obtain from a generating function asymptotic estimates for its underlying coefficients. We apply DPA to a discrete queue in a critical many-sources regime, in order to obtain tail asymptotics for the stationary queue length. As it turns out, this regime leads to a clustering of the poles of the generating function, which re...
متن کاملExternal Profile of Symmetric Digital Search Trees
The external profile is among the first examined shape parameters of digital search trees in connection with the performance of unsuccessful search of a random query in the early 1970s. However, finer and important properties beyond the mean such as the variance and the limit law have remained unknown. In this extended abstract, we describe the first results for the asymptotic variance and the ...
متن کاملHidden Pattern Statistics
Two fundamental problems in combinatorics on words and string manipulation are string matching and sequence comparison. In string matching one searches for all occurrences of a given string, understood as a sequence of consecutive symbols, in a text. In sequence comparison a subsequence rather than a string is searched in a text The string matching problem has been extensively studied in litera...
متن کامل